|
In mathematics, Horner's method (also known as Horner scheme in the UK or Horner's rule in the U.S.) is either of two things: (i) an algorithm for calculating polynomials, which consists of transforming the monomial form into a computationally efficient form;〔 or (ii) a method for approximating the roots of a polynomial. The latter is also known as Ruffini–Horner's method.〔:fr:Méthode de Ruffini-Horner〕 These methods are named after the British mathematician William George Horner, although they were known before him by Paolo Ruffini〔Florian Cajori, (Horner's method of approximation anticipated by Ruffini ), Bulletin of the American Mathematical Society, Vol. 17, No. 9, pp. 409–414, 1911 (read before the Southwestern Section of the American Mathematical Society on November 26, 1910).〕 and, six hundred years earlier, by the Chinese mathematician Qin Jiushao.〔''It is obvious that this procedure is a Chinese invention'', Ulrich Librecht, Chinese Mathematics in the Thirteenth Century, Chapter 13, '' Equations of Higher Degree'', p178 Dover, ISBN 0-486-44619-0〕 ==Description of the algorithm== Given the polynomial : where are real numbers, we wish to evaluate the polynomial at a specific value of , say . To accomplish this, we define a new sequence of constants as follows: : Thus, by iteratively substituting the into the expression, : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Horner's method」の詳細全文を読む スポンサード リンク
|